package leetcode;

import java.util.List;

public class Leetcode559 {
    class Node {
        public int val;
        public List<Node> children;

        public Node() {}

        public Node(int _val) {
            val = _val;
        }

        public Node(int _val, List<Node> _children) {
            val = _val;
            children = _children;
        }
    };
    public int maxDepth(Node root) {
        if(root==null){
            return 0;
        }
        int max = 0;
        if(root.children!=null){
            for(int i = 0;i<root.children.size()-1;i++){
                max = Math.max(max,maxDepth(root.children.get(i)));
            }
        }
        return max+1;
    }
}
